Efficient algorithms to solve atom reconfiguration problems. II. Assignment-rerouting-ordering algorithm

Programmable arrays of optical traps enable the assembly configurations single atoms to perform controlled experiments on quantum many-body systems. Finding sequence control operations transform an arbitrary configuration into a predetermined one requires solving atom reconfiguration problem quickly and efficiently. A typical approach solve problems is use assignment algorithm determine which move traps. This results in protocols that exactly minimize number displacement operations; however, this does not optimize for displaced nor times each displaced, resulting unnecessary increase execution time failure rate protocol. In work, we propose assignment-rerouting-ordering (aro) improve performance assignment-based algorithms problems. The aro uses subroutine total distance traveled by all atoms, rerouting reduce ordering guarantee at most once. relies existence partial moves can be obtained using polynomial-time introduce within formal framework graph theory. We numerically quantify presence absence loss, show it outperforms exact, approximation, heuristic as benchmarks. Our are useful assembling large with high success probability fast preparation time, well designing benchmarking novel algorithms.